Papers with divide-and-conquer approach

5 papers
SentAlign: Accurate and Scalable Sentence Alignment (2023.emnlp-demo)

Copied to clipboard

Challenge: SentAlign is an automatic sentence alignment tool designed for large documents . it evaluates all possible alignment paths in documents of thousands of sentences .
Approach: They present a sentence alignment tool that evaluates all possible alignment paths in parallel documents of thousands of sentences and uses a divide-and-conquer approach to align documents containing tens of thousands.
Outcome: The proposed tool outperforms five other sentence alignment tools on two evaluation sets and on a downstream machine translation task.
UFO: A UI-Focused Agent for Windows OS Interaction (2025.naacl-long)

Copied to clipboard

Challenge: UFO is a UI-Fcused agent designed to fulfill user requests tailored to Windows OS applications . it decomposes user requests using divide-and-conquer approach, enabling seamless navigation and addressing sub-tasks across multiple applications.
Approach: They propose a UI-Fcused Windows OS agent that decomposes user requests using a divide-and-conquer approach and incorporates a control interaction module tailored for Windows OS.
Outcome: The proposed agent decomposes user requests using divide-and-conquer approach, enabling seamless navigation and addressing sub-tasks across multiple applications.
Subgoal Discovery for Hierarchical Dialogue Policy Learning (D18-1)

Copied to clipboard

Challenge: Existing methods to develop dialogue agents for complex tasks require sparse reward signals.
Approach: They propose a divide-and-conquer approach that exploits the hidden structure of a task . they use subgoals to divide a goal-oriented task into simpler subgoal sets .
Outcome: The proposed approach performs competitively against state-of-the-art methods that require human-defined subgoals.
A Divide-And-Conquer Approach for Multi-label Multi-hop Relation Detection in Knowledge Base Question Answering (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for relation detection only detect one path to obtain the answer without considering other correct paths.
Approach: They propose a divide-and-conquer approach for multi-label multi-hop relation detection . they propose 'path sampling mechanism' to generate diverse relation paths .
Outcome: The proposed approach outperforms other competitive approaches on the FreebaseQA benchmark dataset.
MeetingBank: A Benchmark Dataset for Meeting Summarization (2023.acl-long)

Copied to clipboard

Challenge: a lack of annotated meeting corpora hinders the development of meeting summarization technology.
Approach: They present a new benchmark dataset of city council meetings over the past decade . they use a divide-and-conquer approach to divide professionally written minutes into shorter passages .
Outcome: The proposed dataset provides a testbed for various meeting summarization systems and allows the public to gain insight into how council decisions are made.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations